Hyperdecidable Pseudovarieties and the Calculation of Semidirect Products

نویسنده

  • Jorge Almeida
چکیده

This note introduces the notion of a hyperdecidable pseudovariety. This notion appears naturally in trying to prove decidability of the membership problem of semidirect products of pseudovarieties of semigroups. It turns out to be a generalization of a notion introduced by C. J. Ash in connection with his proof of the \type II" theorem. The main results in this paper include a formulation of the deenition of a hyperdecidable pseudovariety in terms of free proonite semigroups, the equivalence with Ash's property in the group case, the behaviour under the operator g of taking the associated global pseudovariety of semigroupoids, and the decidability of V W in case gV is decidable and has a given nite vertex-rank and W is hyperdecidable. A further application of this notion which is given establishes that the join of a hyperdecidable pseudovariety with a locally nite pseudovariety with computable free objects is again hyperdecidable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proonite Categories and Semidirect Products

After developing a theory of implicit operations and proving an analogue of Reiterman's theorem for categories, this paper addresses two complementary questions for semidirect products and two-sided semidirect products of pseudovarieties of semigroups: to determine when a pseudoidentity is valid in it, and to nd a basis of pseudoidentities. The rst question involves looking into the structure o...

متن کامل

Syntactic and Global Semigroup Theory, a Synthesis Approach

This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of semigroups. We introduce various abstract and algorithmic properties that a pseudovariety of semi-groups might possibly satisfy. The main theorem states that given a nite collection of pseudovarieties, each s...

متن کامل

Globals of Pseudovarieties of Commutative Semigroups: the Finite Basis Problem, Decidability, and Gaps

Whereas pseudovarieties of commutative semigroups are known to be nitely based, the globals of monoidal pseudovarieties of commutative semi-groups are shown to be nitely based (or of nite vertex rank) if and only if the index is 0, 1 or !. Nevertheless, on these pseudovarieties, the operation of taking the global preserves decidability. Furthermore, the gaps between many of these globals are sh...

متن کامل

On the Irreducibility of Pseudovarieties of Semigroups

We show that, for every pseudovariety of groups H, the pseudovariety H̄, consisting of all finite semigroups all of whose subgroups lie in H, is irreducible for join and the Mal’cev and semidirect products. The proof involves a Rees matrix construction which motivates the study of iterated Mal’cev products with the pseudovariety of bands. We further provide a strict infinite filtration for H̄ usi...

متن کامل

Trees, Congruences and Varieties of Finite Semigroups By: F. Blanchet-Sadri

A classification scheme for regular languages or finite semigroups was proposed by Pin through tree hierarchies, a scheme related to the concatenation product, an operation on languages, and to the Schützenberger product, an operation on semigroups. Starting with a variety of finite semigroups (or pseudovariety of semigroups) V, a pseudovariety of semigroups ◊u(V) is associated to each tree u. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1999